A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods

نویسندگان

  • S. Anusuya
  • M. Balaganesh
چکیده

Normally Top-k queries are widely used for retrieving a ranked set of ‘k’ most objects based on the individual user preferences. As an example in online market places customer typically search a ranked set of products that satisfy their needs. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many different user preferences. Otherwise the product is not visible to the potential customers. In this paper, we propose a query type namely reverse top-k which leads to a query type that instead returns the set of customers those find a product that belongs to the top-k result of their preferences. It is necessary for the manufacturer to know the market condition based on the competition. The two versions of the proposed query are monochromatic and bichromatic which are introduced in this paper. In monochromatic a geometric interpretation is provided to acquire an intuition of the solution space. In case of bichromatic two query processing techniques are introduced, namely an efficient threshold based algorithm and an algorithm based on materialized reverse top-k views.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Potential Product Using Reverse Top-k Queries

Atpresent, most of the applications return to the user a limited set of ranked results based on the individual user’s preferences, which are commonly validated through top-k queries. From the perspective of a manufacturer, it is imperative that the products appear in the highest ranked positions for many different user preferences, otherwise the product is not visible to the potential customers...

متن کامل

Answering Why-not Questions on Reverse Top-k Queries

Why-not questions, which aim to seek clarifications on the missing tuples for query results, have recently received considerable attention from the database community. In this paper, we systematically explore why-not questions on reverse top-k queries, owing to its importance in multi-criteria decision making. Given an initial reverse top-k query and a missing/why-not weighting vector set Wm th...

متن کامل

Monochromatic and bichromatic reverse top-k group nearest neighbor queries

The Group Nearest Neighbor (GNN) search is an important approach for expert and intelligent systems, i.e., Geographic Information System (GIS) and Decision Support System (DSS). However, traditional GNN search starts from users’ perspective and selects the locations or objects that users like. Such applications fail to help the managers since they do not provide managerial insights. In this pap...

متن کامل

Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors

Due to wireless communication technologies, positioning technologies, and mobile computing develop quickly, mobile services are becoming important on the spatial database management. One of the most important topics in the spatial information query processing is the Reverse Nearest Neighbor query (RNN query). There are two types of the RNN query problem: Monochromatic and Bichromatic RNN querie...

متن کامل

Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data

Article history: Received 7 March 2016 Received in revised form 20 May 2016 Accepted 31 May 2016 Available online 16 July 2016

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014